*special problem implementation number theory *1200

Please click on ads to support us..

Python Code:

a, b, m, r = map(int, input().split())

l = []
s = set()

while True:
	n = ((a * r) + b) % m	
	l.append(n)
	
	if len(s & {n}) == 1:
		break
	else:	
		s.add(n)
				
	r = n
	
for i in range(len(l)):
	if l[i] == l[-1]:
		print(len(l) - i - 1)
		break


Comments

Submit
0 Comments
More Questions

32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols
1213A - Chips Moving
490A - Team Olympiad
233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians
110A - Nearly Lucky Number
1220B - Multiplication Table
1644A - Doors and Keys
1644B - Anti-Fibonacci Permutation
1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room